Extreme Weights in Steinhaus Triangles

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extreme Weights in Steinhaus Triangles

Let {0 = w0 < w1 < w2 < . . . < wm} be the set of weights of binary Steinhaus triangles of size n, and let Wi be the set of sequences in F n 2 that generate triangles of weight wi. In this paper we obtain the values of wi and the corresponding sets Wi for i ∈ {2, 3,m}, and partial results for i = m− 1.

متن کامل

Rotational and dihedral symmetries in Steinhaus and Pascal binary triangles

We give explicit formulae for obtaining the binary sequences which produce Steinhaus triangles and generalized Pascal triangles with rotational and dihedral symmetries.

متن کامل

Methods for Extreme Weights in Sample Surveys Methods for Extreme Weights in Sample Surveys

In survey sampling practice, planned and unplanned variation in the sampling weights can result in inflated sampling variances. As a result, extreme sampling weights are sometimes trimmed to reduce the sampling variance. However, when sampling weights are trimmed, a bias can be introduced into the survey estimates. The goal of sampling weight trimming is to reduce the sampling variance while av...

متن کامل

On a Problem of Molluzzo concerning Steinhaus Triangles in Finite Cyclic Groups

Let X be a finite sequence of length m > 1 in Z/nZ. The derived sequence ∂Xof X is the sequence of length m − 1 obtained by pairwise adding consecutive terms of X. The collection of iterated derived sequences of X, until length 1 is reached, determines a triangle, the Steinhaus triangle ∆X generated by the sequence X. We say that X is balanced if its Steinhaus triangle ∆X contains each element ...

متن کامل

Explicit Computation of Input Weights in Extreme Learning Machines

We present a closed form expression for initializing the input weights in a multilayer perceptron, which can be used as the first step in synthesis of an Extreme Learning Machine. The expression is based on the standard function for a separating hyperplane as computed in multilayer perceptrons and linear Support Vector Machines; that is, as a linear combination of input data samples. In the abs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2016

ISSN: 1571-0653

DOI: 10.1016/j.endm.2016.09.060